Covariance discriminative power of kernel clustering methods

نویسندگان

چکیده

Let x1,⋯,xn be independent observations of size p, each them belonging to one c distinct classes. We assume that within the class a are characterized by their distribution N(0,1 pCa) where here C1,⋯,Cc some non-negative definite p×p matrices. This paper studies asymptotic behavior symmetric matrix Φ˜kl=p(x kTx l)2δ k≠l when p and n grow infinity with p→c0. Particularly, we prove that, if covariance matrices sufficiently close in certain sense, Φ˜ behaves like low-rank perturbation Wigner matrix, presenting possibly isolated eigenvalues outside bulk semi-circular law. carry out careful analysis associated eigenvectors illustrate how these results can help understand spectral clustering methods use as kernel matrix.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Kernel Methods for Nonlinear Discriminative Data Analysis

Optimal Component Analysis (OCA) is a linear subspace technique for dimensionality reduction designed to optimize object classification and recognition performance. The linear nature of OCA often limits recognition performance, if the underlying data structure is nonlinear or cluster structures are complex. To address these problems, we investigate a kernel analogue of OCA, which consists of ap...

متن کامل

Discriminative Slot Detection Using Kernel Methods

Most traditional information extraction approaches are generative models that assume events exist in text in certain patterns and these patterns can be regenerated in various ways. These assumptions limited the syntactic clues being considered for finding an event and confined these approaches to a particular syntactic level. This paper presents a discriminative framework based on kernel SVMs t...

متن کامل

Spectral Kernel Methods for Clustering

In this paper we introduce new algorithms for unsupervised learning based on the use of a kernel matrix. All the information required by such algorithms is contained in the eigenvectors of the matrix or of closely related matrices. We use two different but related cost functions, the Alignment and the 'cut cost'. The first one is discussed in a companion paper [3], the second one is based on gr...

متن کامل

An Experimental Comparison of Kernel Clustering Methods

In this paper, we compare the performances of some among the most popular kernel clustering methods on several data sets. The methods are all based on central clustering and incorporate in various ways the concepts of fuzzy clustering and kernel machines. The data sets are a sample of several application domains and sizes. A thorough discussion about the techniques for validating results is als...

متن کامل

Clustering evolving data using kernel-based methods

Thanks to recent developments of Information Technologies, there is a profusion of available data in a wide range of application domains ranging from science and engineering to biology and business. For this reason, the demand for real-time data processing, mining and analysis is experiencing an explosive growth in recent years. Since labels are usually not available and in general a full under...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Journal of Statistics

سال: 2023

ISSN: ['1935-7524']

DOI: https://doi.org/10.1214/23-ejs2107